Solving the 100 Swiss Francs Problem

Sturmfels offered 100 Swiss Francs in 2005 to a conjecture, which deals with a special case of the maximum likelihood estimation for a latent class model. This paper confirms the conjecture positively

A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs

In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any convex separable objective function. We conclude with two sample applications, stochastic integer programs with second-order dominance constraints and stochastic integer multi-commodity flows, which (for fixed blocks) can be solved in polynomial time in the number of scenarios and commodities and in the binary encoding length of the input data. In the proof of our main theorem we combine several non-trivial constructions from the theory of Graver bases. We are confident that our approach paves the way for further extensions

A polynomial oracle-time algorithm for convex integer minimization

In this paper we consider the solution of certain convex integer minimization problems via greedy augmentation procedures. We show that a greedy augmentation procedure that employs only directions from certain Graver bases needs only polynomially many augmentation steps to solve the given problem. We extend these results to convex $N$-fold integer minimization problems and to convex 2-stage stochastic integer minimization problems. Finally, we present some applications of convex $N$-fold integer minimization problems for which our approach provides polynomial time solution algorithms.Comment: 19 pages, 1 figur

Likelihood Geometry

We study the critical points of monomial functions over an algebraic subset of the probability simplex. The number of critical points on the Zariski closure is a topological invariant of that embedded projective variety, known as its maximum likelihood degree. We present an introduction to this theory and its statistical motivations. Many favorite objects from combinatorial algebraic geometry are featured: toric varieties, A-discriminants, hyperplane arrangements, Grassmannians, and determinantal varieties. Several new results are included, especially on the likelihood correspondence and its bidegree. These notes were written for the second author's lectures at the CIME-CIRM summer course on Combinatorial Algebraic Geometry at Levico Terme in June 2013.Comment: 45 pages; minor changes and addition

Symbolic powers of monomial ideals and Cohen-Macaulay vertex-weighted digraphs

In this paper we study irreducible representations and symbolic Rees algebras of monomial ideals. Then we examine edge ideals associated to vertex-weighted oriented graphs. These are digraphs having no oriented cycles of length two with weights on the vertices. For a monomial ideal with no embedded primes we classify the normality of its symbolic Rees algebra in terms of its primary components. If the primary components of a monomial ideal are normal, we present a simple procedure to compute its symbolic Rees algebra using Hilbert bases, and give necessary and sufficient conditions for the equality between its ordinary and symbolic powers. We give an effective characterization of the Cohen--Macaulay vertex-weighted oriented forests. For edge ideals of transitive weighted oriented graphs we show that Alexander duality holds. It is shown that edge ideals of weighted acyclic tournaments are Cohen--Macaulay and satisfy Alexander dualityComment: Special volume dedicated to Professor Antonio Campillo, Springer, to appea

Nonlinear Integer Programming

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of a simple version of general nonlinear integer problems, where all constraints are still linear. Our focus is on the computational complexity of the problem, which varies significantly with the type of nonlinear objective function in combination with the underlying combinatorial structure. Numerous boundary cases of complexity emerge, which sometimes surprisingly lead even to polynomial time algorithms. We also cover recent successful approaches for more general classes of problems. Though no positive theoretical efficiency results are available, nor are they likely to ever be available, these seem to be the currently most successful and interesting approaches for solving practical problems. It is our belief that the study of algorithms motivated by theoretical considerations and those motivated by our desire to solve practical instances should and do inform one another. So it is with this viewpoint that we present the subject, and it is in this direction that we hope to spark further research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50 Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2009, ISBN 354068274

Integrality gaps of integer knapsack problems

We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a “typical” knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario

Fabrication of microporous ceramics from ceramic powders of quartz-natural zeolite mixtures

The possibility of producing ceramic powders suitable for the fabrication of microporous filters was investigated through the thermal treatment of the powder mixtures of a high-purity (99.09% SiO2) quartz and clinoptilolite type of natural zeolite. The quartz and zeolite, mixed in the ratio of 3:1 by weight, was wet ground in a ball mill, the powder was sieved on a 90-mum screen, and the undersize was dried and sintered in the powder form at the temperatures of 1000, 1100 and 1200degreesC for 7 h in an air furnace. The powder sinter products were deagglomerated by gentle crushing in an agate mortar and then characterized by phase composition, density, and specific surface area measurements. The added zeolite facilitated the transformation of quartz to cristobalite. The phase transformation of quartz to cristobalite first appeared at around 1000 degreesC, and, at 1200 degreesC, led to a ceramic powder sufficiently high in cristobalite content for the fabrication of the microporous ceramic bodies. Re-sintering at 1200 degreesC of the pressed forms of the ceramic powder resulted in microporous (0.5-3 mum) ceramics with a high porosity of 48.5%, and a three-point bend strength of similar to140 kg/cm(2). The ceramics obtained may have potential for filter applications. (C) 2003 Elsevier Ltd and Techna S.r.l. All rights reserved